An Implementation of Communicating Reactive Processes

It has recently been shown that both asynchrony and perfect synchrony are needed for the speciication of complex reactive systems and a paradigm called Communicating Reactive Processes (CRP) was proposed towards such a uniication. The paradigm consists of a network of perfectly synchronous nodes communicating asynchronously. This paper addresses the implementation issues of such paradigms and discusses possible implementations that are consistent with the reactive and rendezvous preserving semantics. We present a deadlock-free protocol for the implementation of CRP. The implementation is shown to preserve the reactive nature of the synchronous nodes and also establishes techniques that will enable us to realize an implementation that preserves the rendezvous semantics if so desired. The paper discusses the properties satissed by the implementation and shows that the implementation also provides another implementation for Hoare's CSP.